Minimalist grammars and recognition

نویسندگان

  • Edward P. Stabler
  • Henk Harkema
  • Ed Keenan
  • Hilda Koopman
چکیده

Abstract Recent work has shown how basic ideas of the minimalist tradition in transformational syntax can be captured in a simple generative formalism, a “derivational minimalism.” This framework can model “remnant movement” analyses, which yield more complex antecedent-trace relations, suggesting a new and significant sense in which linguistic structures are “chain based.” Michaelis (1998) showed that these grammars correspond to a certain kind of linear context free rewrite system, and this paper takes the next step of adapting the recognition methods for “non-concatenative” grammars (Weir, 1988; Seki et al., 1991; Boullier, 1999). This turns out to be quite straightforward once the grammars are set out appropriately.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on the Complexity of the Recognition Problem for the Minimalist Grammars with Unbounded Scrambling and Barriers

Minimalist Grammars were proposed recently as a model for the formal description of the natural-language syntax. This paper explores a nonlocal extension to this formalism that would make it possible to describe unbounded scrambling which is a discriptionally problematic syntactic phenomenon attested in many languages. It is shown that extending Minimalist Grammars with scrambling without short...

متن کامل

Semantic Aspects of Minimalist Grammars

Minimalist grammars are a rich lexicalized syntactic formalism which inherits the depth and wide covering of the generative tradition. Nevertheless up to now there is no straightforward way to extract the predicative structure of a sentence from syntactic analyses and from the predicative structure of the lexical items. In this paper we try to apply to this richer syntactic model the traditiona...

متن کامل

Dependency Structures Derived from Minimalist Grammars

This paper provides an interpretation of Minimalist Grammars [16,17] in terms of dependency structures. Under this interpretation, merge operations derive projective dependency structures, and movement operations introduce both non-projectivity and illnestedness. This new characterization of the generative capacity of Minimalist Grammar makes it possible to discuss the linguistic relevance of n...

متن کامل

Tree Adjunction as Minimalist Lowering

Even though Minimalist grammars are more powerful than TAG on the string level, the classes of tree languages the two define are incomparable. I give a constructive proof that if the standard Move operation in Minimalist grammars is replaced by Reset Lowering, every TAG tree language can be generated. The opposite does not hold, so the strong generative capacity of Minimalist grammars with Rese...

متن کامل

A probabilistic top-down parser for minimalist grammars

This paper describes a probabilistic top-down parser for minimalist grammars. Top-down parsers have the great advantage of having a certain predictive power during the parsing, which takes place in a left-to-right reading of the sentence. Such parsers have already been well-implemented and studied in the case of Context-Free Grammars (see for example [Roa01]), which are already top-down, but th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000